Removable Cycles in Planar Graphs
نویسنده
چکیده
All graphs considered are finite and loopless, but may contain multiple edges. By a simple graph we shall mean a graph without multiple edges. It follows easily from a result of Mader [4, Theorem 1] that if G is a ^-connected simple graph of minimum degree at least k+2, then G contains a cycle C such that G-E(C) is ^-connected. Stronger results exist for the special case of 2-connected simple graphs.
منابع مشابه
0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملA new constraint of the Hamilton cycle algorithm
Grinberg’s theorem is a necessary condition for the planar Hamilton graphs. In this paper, we use cycle bases and removable cycles to survey cycle structures of the Hamiltonian graphs and derive an equation of the interior faces in Grinberg’s Theorem. The result shows that Grinberg’s Theorem is suitable for the connected and simple graphs. Furthermore, by adding a new constraint of solutions to...
متن کاملSolutions of Grinberg equation and removable cycles in a cycle basis
Let G (V, E) be a simple graph with vertex set V and edge set E. A generalized cycle is a subgraph such that any vertex degree is even. A simple cycle (briefly in a cycle) is a connected subgraph such that every vertex has degree 2. A basis of the cycle space is called a cycle basis of G (V, E). A cycle basis where the sum of the weights of the cycles is minimal is called a minimum cycle basis ...
متن کاملRemovable Cycles in 2-connected Graphs of Minimum Degree at Least Four
The lower bound on the length of 'removable' cycles in Theorem 1 is essentially best possible since there exist 2-connected simple graphs of minimum degree k whose longest 'removable' cycle has length k + i. Moreover, for the special case k = 4, we can construct 2-connected, 4-regular simple graphs whose longest 'removable' cycle has length four. The following counterexample which was independe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985